Parallel Signatur Analysis Design with Bounds on Aliasing

Correction to the Proof of Theorem 2 in "Parallel Signature Analysis Design with Bounds on Aliasing"

Simple Bounds on Serial Signature Analysis Aliasing for Random Testing

It is shown that the aliasing probability is bounded above by (1 + E ) / L M 1/L ( E small for large L) for test lengths L less than the period, L,, of the signature polynomial; for test lengths L that are multiples of L,, the aliasing probability is bounded above by 1; and, for test lengths L greater than L, and not a multiple of L,, the aliasing probability is bounded above by 2 / ( L c + 1)....

Refined Bounds on Signature Analysis Aliasing for Random Testing

in previous work a simple bound, ~ + 2 , on the aliasing probability in serial signature analysis for a random test pattern of length L was derived. This simple bound is sharpened here by almost a factor of two. For serial signature analysis, it is shown that the I+& 1 aliasing probability is bounded above by = L ( E L small for large L ) for test lengths L less than the period, Lc, of the sign...

Evaluating Design Tradeoffs in Numeric Static Analysis for Java

Numeric static analysis for Java has a broad range of potentially useful applications, including array bounds checking and resource usage estimation. However, designing a scalable numeric static analysis for real-world Java programs presents a multitude of design choices, each of which may interact with others. For example, an analysis could handle method calls via either a top-down or bottom-u...

On the Complexity of Parallel

We study several data-structures and operations that commonly arise in parallel implementations of logic programming languages. The main problems that arise in implementing such parallel systems are abstracted out and precisely stated. Upper and lower bounds are derived for several of these problems. We prove a lower bound of (log n) on the overhead incurred in implementing even a simpliied ver...